On maximally nonlinear and extremal balanced Boolean functions
نویسنده
چکیده
We prove a new sufficient condition for a Boolean function to be extremal balanced or maximally nonlinear, in odd or even dimension. Under this condition, we deduce the balanced covering radius ρB(n) and the covering radius ρ(n). We prove some general properties about maximally nonlinear or extremal balanced functions. Finally, an application to even weights Boolean functions is given.
منابع مشابه
Cryptographer's Toolkit for Construction of 8-Bit Bent Functions
Boolean functions form basic building blocks in various cryptographic algorithms. They are used for instance as filters in stream ciphers. Maximally non-linear (necessarily non-balanced) Boolean functions with an even number of variables are called bent functions. Bent functions can be modified to get balanced highly non-linear Boolean functions. Recently the first author has demonstrated how b...
متن کاملA Novel Image Structural Similarity Index Considering Image Content Detectability Using Maximally Stable Extremal Region Descriptor
The image content detectability and image structure preservation are closely related concepts with undeniable role in image quality assessment. However, the most attention of image quality studies has been paid to image structure evaluation, few of them focused on image content detectability. Examining the image structure was firstly introduced and assessed in Structural SIMilarity (SSIM) measu...
متن کاملSearching Extrema on the Regular Graph of Balanced Boolean Maps
The class of Boolean functions has a structure of a Boolean algebra and a -dimensional vector space over the prime field of characteristic two. Here we consider the graph whose nodes are the balanced Boolean functions and whose edges are pairs of maps with sum a balanced map. This is a regular graph with degree ` ́ . Within this graph it is posed the problem to find extreme values of the non li...
متن کاملHighly Nonlinear 0 - 1 Balanced Boolean Functions Satisfying
Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 0-1 balanced and hence cannot be directly used in many cryptosystems where 0-1 balancedness is needed. In this paper we construct (i) 0-1 balanced boolean functions on V2k+1 (k > = 1) having nonlinea...
متن کاملHeuristic Design of Cryptographically Strong Balanced Boolean Functions
1 I n t r o d u c t i o n It is well known that the resistance of a product cipher to modern cryptanalytic attacks such as linear and differential cryptanalysis [10,1] depends critically upon the nonlinearity of the Boolean functions comprising the round function. Typically these functions must be balanced, so there is considerable interest in the design of highly nonlinear balanced Boolean fun...
متن کامل